Convex Relaxation for Optimal Power Flow Problem: Mesh Networks
نویسندگان
چکیده
منابع مشابه
Convex Relaxation of Optimal Power Flow - Part II: Exactness
This tutorial summarizes recent advances in the convex relaxation of the optimal power flow (OPF) problem, focusing on structural properties rather than algorithms. Part I presents two power flow models, formulates OPF and their relaxations in each model, and proves equivalence relations among them. Part II presents sufficient conditions under which the convex relaxations are exact. Citation: I...
متن کاملRecover Feasible Solutions for SOCP Relaxation of Optimal Power Flow Problems in Mesh Networks
Convex relaxation methods have been studied and used extensively to obtain an optimal solution to the optimal power flow (OPF) problem. Meanwhile, convex relaxed power flow equations are also prerequisites for efficiently solving a wide range of problems in power systems including mixed-integer nonlinear programming (MINLP) and distributed optimization. When the exactness of convex relaxations ...
متن کاملBranch Flow Model for Radial Networks: Convex Relaxation
Power flow optimization is generally nonlinear and non-convex, and a second-order cone relaxation has been proposed recently for convexification. We prove several sufficient conditions under which the relaxation is exact. One of these conditions seems particularly realistic and suggests guidelines on integrating distributed generations.
متن کاملConvex Relaxation of Optimal Power Flow - Part I: Formulations and Equivalence
This tutorial summarizes recent advances in the convex relaxation of the optimal power flow (OPF) problem, focusing on structural properties rather than algorithms. Part I presents two power flow models, formulates OPF and their relaxations in each model, and proves equivalence relations among them. Part II presents sufficient conditions under which the convex relaxations are exact. Citation: I...
متن کاملAnalysis of Semidefinite Programming Relaxation of Optimal Power Flow for Cyclic Networks
The optimal power flow (OPF) problem determines an optimal operating point of the power network that minimizes a certain objective function subject to physical and network constraints. There has been a great deal of attention in convex relaxation of the OPF problem in recent years, and it has been shown that a semidefinite programming (SDP) relaxation can solve different classes of the nonconve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Power Systems
سال: 2015
ISSN: 0885-8950,1558-0679
DOI: 10.1109/tpwrs.2014.2322051